An Exact Method for Berth Allocation at Raw Material Docks
نویسندگان
چکیده
This paper studies a short-term berth allocation problem encountered in the Baoshan Iron and Steel complex. A mathematical model is developed for the problem to minimize the total tardiness particularly considering special industrial characteristics. A lower bound derived by performing a Lagrangian relaxation, along with appropriate branching rules, is incorporated into a branch and bound algorithm for the berth allocation problem. Real data collected from the Baoshan Iron and Steel Complex are used to test the performance of the algorithm. Computation result indicates that the optimal berth scheduling can be obtained for the industrial-sized problem within an acceptable running time. Copyright © 2005 IFAC
منابع مشابه
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch-and-price algorithm is implemented to produce optimal integer solutions to the problem. In particular, we present several accelerating techniques for...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملOptimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملMinimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...
متن کاملWorking Paper The berth allocation problem with mobile quay walls
The berth allocation problem (BAP), which de nes a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for e ciently operating a container port. In this paper we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled oating platforms, which encase ships moored at the immobile quay and provide additional quay ...
متن کامل